TSTP Solution File: SET171^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET171^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:04:32 EDT 2024
% Result : Theorem 0.23s 0.39s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 27
% Syntax : Number of formulae : 85 ( 21 unt; 18 typ; 0 def)
% Number of atoms : 560 ( 100 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 425 ( 31 ~; 100 |; 31 &; 257 @)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 95 ( 95 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 8 con; 0-3 aty)
% Number of variables : 59 ( 43 ^ 9 !; 6 ?; 59 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(func_def_30,type,
sK2: $i > $o ).
thf(func_def_32,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f135,plain,
$false,
inference(avatar_sat_refutation,[],[f104,f111,f120,f123,f126,f134]) ).
thf(f134,plain,
( ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f133]) ).
thf(f133,plain,
( $false
| ~ spl3_3
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f129,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_5 ),
inference(superposition,[],[f119,f108]) ).
thf(f108,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f106]) ).
thf(f106,plain,
( spl3_3
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f119,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f117]) ).
thf(f117,plain,
( spl3_5
<=> ( $false
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f126,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f125]) ).
thf(f125,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f124]) ).
thf(f124,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f99,f115]) ).
thf(f115,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f113]) ).
thf(f113,plain,
( spl3_4
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f99,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f97]) ).
thf(f97,plain,
( spl3_1
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f123,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f122]) ).
thf(f122,plain,
( $false
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f121]) ).
thf(f121,plain,
( ( $false = $true )
| ~ spl3_2 ),
inference(forward_demodulation,[],[f103,f81]) ).
thf(f81,plain,
( $false
= ( sK2 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f78]) ).
thf(f78,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f77]) ).
thf(f77,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f70]) ).
thf(f70,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f57]) ).
thf(f57,plain,
( ( $false
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f56]) ).
thf(f56,plain,
( ( $false
= ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f55]) ).
thf(f55,plain,
( ( $false
= ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f53]) ).
thf(f53,plain,
( ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
!= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f52]) ).
thf(f52,plain,
( ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK2 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f51]) ).
thf(f51,plain,
( ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK2 @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f50]) ).
thf(f50,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK2
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK2
@ sK0 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK2
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK1
@ sK0 ) ) ),
inference(definition_unfolding,[],[f48,f49,f47,f47,f47,f49]) ).
thf(f47,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f31]) ).
thf(f31,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) )
= union ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
| ( X2 @ X3 ) ) )
= union ),
file('/export/starexec/sandbox/tmp/tmp.WloSw9gBgt/Vampire---4.8_1849',union) ).
thf(f49,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f23,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= intersection ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) )
= intersection ),
file('/export/starexec/sandbox/tmp/tmp.WloSw9gBgt/Vampire---4.8_1849',intersection) ).
thf(f48,plain,
( ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK2 @ sK0 ) )
!= ( union @ sK2 @ ( intersection @ sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK2 @ sK0 ) )
!= ( union @ sK2 @ ( intersection @ sK1 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45]) ).
thf(f45,plain,
( ? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ X2 @ ( intersection @ X1 @ X0 ) )
!= ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X2 @ X0 ) ) )
=> ( ( intersection @ ( union @ sK2 @ sK1 ) @ ( union @ sK2 @ sK0 ) )
!= ( union @ sK2 @ ( intersection @ sK1 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ X2 @ ( intersection @ X1 @ X0 ) )
!= ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X2 @ X0 ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ X2 @ ( intersection @ X1 @ X0 ) )
= ( intersection @ ( union @ X2 @ X1 ) @ ( union @ X2 @ X0 ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X6: $i > $o,X5: $i > $o,X4: $i > $o] :
( ( union @ X4 @ ( intersection @ X5 @ X6 ) )
= ( intersection @ ( union @ X4 @ X5 ) @ ( union @ X4 @ X6 ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X6: $i > $o,X5: $i > $o,X4: $i > $o] :
( ( union @ X4 @ ( intersection @ X5 @ X6 ) )
= ( intersection @ ( union @ X4 @ X5 ) @ ( union @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WloSw9gBgt/Vampire---4.8_1849',union_distributes_over_intersection) ).
thf(f103,plain,
( ( ( sK2 @ sK5 )
= $true )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f101]) ).
thf(f101,plain,
( spl3_2
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f120,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f64,f117,f113]) ).
thf(f64,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f63]) ).
thf(f63,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f60]) ).
thf(f60,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f58]) ).
thf(f58,plain,
( ( $false
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f56]) ).
thf(f111,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f89,f101,f106]) ).
thf(f89,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f88]) ).
thf(f88,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f86]) ).
thf(f86,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f85]) ).
thf(f85,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f84]) ).
thf(f84,plain,
( ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f83]) ).
thf(f83,plain,
( ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f54]) ).
thf(f54,plain,
( ( ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true )
| ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f53]) ).
thf(f104,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f95,f101,f97]) ).
thf(f95,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f93]) ).
thf(f93,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f92]) ).
thf(f92,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f91]) ).
thf(f91,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
( ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f82]) ).
thf(f82,plain,
( ( ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) )
= $true )
| ( $true
= ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET171^3 : TPTP v8.1.2. Released v3.6.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 17:26:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.WloSw9gBgt/Vampire---4.8_1849
% 0.23/0.38 % (2120)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.23/0.38 % (2119)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.23/0.38 % (2118)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.23/0.38 % (2121)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.23/0.38 % (2122)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.23/0.39 % (2123)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.23/0.39 % (2121)Instruction limit reached!
% 0.23/0.39 % (2121)------------------------------
% 0.23/0.39 % (2121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (2121)Termination reason: Unknown
% 0.23/0.39 % (2121)Termination phase: shuffling
% 0.23/0.39
% 0.23/0.39 % (2121)Memory used [KB]: 895
% 0.23/0.39 % (2121)Time elapsed: 0.003 s
% 0.23/0.39 % (2121)Instructions burned: 2 (million)
% 0.23/0.39 % (2121)------------------------------
% 0.23/0.39 % (2121)------------------------------
% 0.23/0.39 % (2122)Instruction limit reached!
% 0.23/0.39 % (2122)------------------------------
% 0.23/0.39 % (2122)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (2122)Termination reason: Unknown
% 0.23/0.39 % (2122)Termination phase: shuffling
% 0.23/0.39
% 0.23/0.39 % (2122)Memory used [KB]: 895
% 0.23/0.39 % (2122)Time elapsed: 0.003 s
% 0.23/0.39 % (2122)Instructions burned: 2 (million)
% 0.23/0.39 % (2122)------------------------------
% 0.23/0.39 % (2122)------------------------------
% 0.23/0.39 % (2119)Instruction limit reached!
% 0.23/0.39 % (2119)------------------------------
% 0.23/0.39 % (2119)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (2119)Termination reason: Unknown
% 0.23/0.39 % (2119)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (2119)Memory used [KB]: 5500
% 0.23/0.39 % (2119)Time elapsed: 0.005 s
% 0.23/0.39 % (2119)Instructions burned: 4 (million)
% 0.23/0.39 % (2119)------------------------------
% 0.23/0.39 % (2119)------------------------------
% 0.23/0.39 % (2123)First to succeed.
% 0.23/0.39 % (2124)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.23/0.39 % (2118)Also succeeded, but the first one will report.
% 0.23/0.39 % (2123)Refutation found. Thanks to Tanya!
% 0.23/0.39 % SZS status Theorem for Vampire---4
% 0.23/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.39 % (2123)------------------------------
% 0.23/0.39 % (2123)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (2123)Termination reason: Refutation
% 0.23/0.39
% 0.23/0.39 % (2123)Memory used [KB]: 5500
% 0.23/0.39 % (2123)Time elapsed: 0.007 s
% 0.23/0.39 % (2123)Instructions burned: 5 (million)
% 0.23/0.39 % (2123)------------------------------
% 0.23/0.39 % (2123)------------------------------
% 0.23/0.39 % (2117)Success in time 0.021 s
% 0.23/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------